An Introduction to Graph Homomorphisms
نویسنده
چکیده
This paper aims to give a focused introduction to algebraic graph theory accessible to mathematically mature undergraduates. We will begin by giving some standard definitions, then expanding our focus to specifically study properties of graph homomorphisms in the context of constraint satisfaction problems (graph coloring in disguise). In particular, we will be discussing the idea of graph coloring by abstracting what it means for a graph to be colorable, and expanding this abstraction to deal with more complex instances of the graph coloring problem.
منابع مشابه
Workshop on Covering Arrays: Constructions, Applications and Generalizations Plenary Talks
Rick Brewster, Thompson Rivers University Graph Homomorphisms, an introduction This talk is an introduction to the subject of graph homomorphisms. The concept of homomorphisms appears in many areas of mathematics, and the field of graph theory is no exception. However, until recently most graph theorists did not view graph homomorphisms as a central topic in the discipline. In their recent book...
متن کاملGraph homomorphisms: structure and symmetry
This paper is the first part of an introduction to the subject of graph homomorphism in the mixed form of a course and a survey. We give the basic definitions, examples and uses of graph homomorphisms and mention some results that consider the structure and some parameters of the graphs involved. We discuss vertex transitive graphs and Cayley graphs and their rather fundamental role in some asp...
متن کاملHomomorphisms of Signed Graphs
A signed graph [G,Σ] is a graph G together with an assignment of signs + and − to all the edges of G where Σ is the set of negative edges. Furthermore [G,Σ1] and [G,Σ2] are considered to be equivalent if the symmetric difference of Σ1 and Σ2 is an edge cut of G. Naturally arising from matroid theory, several notions of graph theory, such as the theory of minors and the theory of nowhere-zero fl...
متن کاملColoring Graphs with Graphs: a Survey
Many problems in and areas of graph theory can be thought of in terms of graph homomorphisms. For graphs G and H, a homomorphism from G to H is a function φ : V (G)→ V (H) such that if xy ∈ E(G) then φ(x)φ(y) ∈ E(H). (See [1] for a comprehensive introduction.) Let Hom(G,H) be the set of homomorphisms from G to H. In this survey, we will be interested in counting homomorphisms from G to H and so...
متن کاملComputing the partition function for graph homomorphisms
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries include efficient algorithms for computing weighted sums approximating the number of k-colorings and the number of independent sets in a graph, as well as a...
متن کامل